Local Approximability of Max-Min and Min-Max Linear Programs
نویسندگان
چکیده
منابع مشابه
Reducing Linear Programs into Min-max Problems
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of [1].
متن کاملTight Local Approximation Results for Max-Min Linear Programs
In a bipartite max-min LP, we are given a bipartite graph G = (V ∪ I ∪ K,E), where each agent v ∈ V is adjacent to exactly one constraint i ∈ I and exactly one objective k ∈ K. Each agent v controls a variable xv. For each i ∈ I we have a nonnegative linear constraint on the variables of adjacent agents. For each k ∈ K we have a nonnegative linear objective function of the variables of adjacent...
متن کاملFinite-Horizon Min-Max Control of Max-Plus-Linear Systems
In this note, we provide a solution to a class of finite-horizon min–max control problems for uncertain max-plus-linear systems where the uncertain parameters are assumed to lie in a given convex and compact set, and it is required that the closed-loop input and state sequence satisfy a given set of linear inequality constraints for all admissible uncertainty realizations. We provide sufficient...
متن کاملMax-Min Representation of Piecewise Linear Functions
It is shown that a piecewise linear function on a convex domain in R can be represented as a boolean polynomial in terms of its linear components.
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2010
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-010-9303-6